QUASI-CLOSED SETS AND FIXED POINTS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi Contraction and Fixed Points

In this note, we establish and improve some results on fixed point theory in topological vector spaces. As a generalization of contraction maps, the concept of quasi contraction multivalued maps on a topological vector space will be defined. Further, it is shown that a quasi contraction and closed multivalued map on a topological vector space has a unique fixed point if it is bounded value.

متن کامل

Quasi-Metrics and Fixed Points in Computing

We consider quasi-metrics as a technical tool for use in theoretical computer science. In particular, we discuss their use in nding xed points of operators arising in programming language semantics, especially those arising in logic programming .

متن کامل

Quasi-completeness and functions without fixed-points

Q-reducibility is a natural generalization of many-one reducibility (m-reducibility): if A ≤m B via a computable function f(x), then A ≤Q B via the computable function g(x) such that Wg(x) = {f(x)}. Also this reducibility is connected with enumeration reducibility (e-reducibility) as follows: if A ≤Q B via a computable function g(x), then ω −A ≤e ω −B via the c. e. set W = {〈x, 2y〉 | x ∈ ω, y ∈...

متن کامل

On Sets, Types, Fixed Points, and Checkerboards

Most current research on automated theorem proving is concerned with proving theorems of first-order logic. We discuss two examples which illustrate the advantages of using higher-order logic in certain contexts. For some purposes type theory is a much more convenient vehicle for formalizing mathematics than axiomatic set theory. Even theorems of first-order logic can sometimes be proven more e...

متن کامل

Fixed Points in Cartesian Closed Categories

The purpose of this paper is to begin the study of domain theory in a context that is also appropriate for semantic models of other aspects of computation, that is in cartesian closed categories with a natural numbers object. I show that if D is an internally ω -complete partial order with bottom in such a category, then the usual construction of least fixed point of an ω -continuous endomorphi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 1967

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.57.2.201